On Hard and Soft Decision Decoding of BCH Codes

The binary primitive BCH codes are cyclic and constructed by choosing a subset of the cyclotomic cosets. Which is chosen determines dimension, minimum distance weight distribution code. We construct possible determine their coderate, true non-equivalent codes. A particular choice cosets gives which are, extended one bit, equivalent to Reed-Muller codes, known result from sixties. show that have possibly better parameters than related in recent publications polar study decoding performance these different using information set based on minimal codewords dual even case channel without reliability since algorithm inherently calculates information. Different same rate compared performances complexity observed. Some examples hard decision as maximum likelihood decoding. All presented methods can be include Gaussian for soft simulation results list compare other methods.